Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 859 results
Sort by: relevance publication year

Multi-Head Finite Automata: Characterizations, Concepts and Open Problems

JOURNAL ARTICLE published 25 June 2009 in Electronic Proceedings in Theoretical Computer Science

Authors: Markus Holzer | Martin Kutrib | Andreas Malcher

Input-Driven Double-Head Pushdown Automata

JOURNAL ARTICLE published 21 August 2017 in Electronic Proceedings in Theoretical Computer Science

Authors: Markus Holzer | Martin Kutrib | Andreas Malcher | Matthias Wendlandt

Measuring Communication in Parallel Communicating Finite Automata

JOURNAL ARTICLE published 21 May 2014 in Electronic Proceedings in Theoretical Computer Science

Authors: Henning Bordihn | Martin Kutrib | Andreas Malcher

Transductions Computed by One-Dimensional Cellular Automata

JOURNAL ARTICLE published 13 August 2012 in Electronic Proceedings in Theoretical Computer Science

Authors: Martin Kutrib | Andreas Malcher

Reversible Computations of One-Way Counter Automata

JOURNAL ARTICLE published 27 August 2022 in Electronic Proceedings in Theoretical Computer Science

Authors: Martin Kutrib | Andreas Malcher

Bounded Languages Meet Cellular Automata with Sparse Communication

JOURNAL ARTICLE published 30 July 2009 in Electronic Proceedings in Theoretical Computer Science

Authors: Martin Kutrib | Andreas Malcher

From Finite Automata to Regular Expressions and Back—A Summary on Descriptional Complexity

JOURNAL ARTICLE published 21 May 2014 in Electronic Proceedings in Theoretical Computer Science

Authors: Hermann Gruber | Markus Holzer

On the Descriptional Complexity of Operations on Semilinear Sets

JOURNAL ARTICLE published 21 August 2017 in Electronic Proceedings in Theoretical Computer Science

Authors: Simon Beier | Markus Holzer | Martin Kutrib

Reversible Two-Party Computations

JOURNAL ARTICLE published 3 September 2023 in Electronic Proceedings in Theoretical Computer Science

Authors: Martin Kutrib | Andreas Malcher

Iterated Uniform Finite-State Transducers on Unary Languages

JOURNAL ARTICLE published in SSRN Electronic Journal

Authors: Martin Kutrib | Andreas Malcher | Carlo Mereghetti | Beatrice Palano

On the Accepting State Complexity of Operations on Permutation Automata

JOURNAL ARTICLE published 27 August 2022 in Electronic Proceedings in Theoretical Computer Science

Authors: Christian Rauch | Markus Holzer

On Measuring Non-Recursive Trade-Offs

JOURNAL ARTICLE published 30 July 2009 in Electronic Proceedings in Theoretical Computer Science

Authors: Hermann Gruber | Markus Holzer | Martin Kutrib

On One-way One-bit O (One)-message Cellular Automata

JOURNAL ARTICLE published October 2009 in Electronic Notes in Theoretical Computer Science

Authors: Martin Kutrib | Andreas Malcher

Deterministic Real-Time Tree-Walking-Storage Automata

JOURNAL ARTICLE published 15 September 2023 in Electronic Proceedings in Theoretical Computer Science

Authors: Martin Kutrib | Uwe Meyer

The Magic Number Problem for Subregular Language Families

JOURNAL ARTICLE published 7 August 2010 in Electronic Proceedings in Theoretical Computer Science

Authors: Markus Holzer | Sebastian Jakobi | Martin Kutrib

Multi-dimension Quantitative Games: Complexity and Strategy Synthesis

JOURNAL ARTICLE published 7 October 2012 in Electronic Proceedings in Theoretical Computer Science

Authors: Jean-François Raskin

State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters

JOURNAL ARTICLE published 3 September 2023 in Electronic Proceedings in Theoretical Computer Science

Authors: Benedek Nagy

The Pagoda Sequence: a Ramble through Linear Complexity, Number Walls, D0L Sequences, Finite State Automata, and Aperiodic Tilings

JOURNAL ARTICLE published 25 June 2009 in Electronic Proceedings in Theoretical Computer Science

Authors: Fred Lunnon

Modelling Implicit Communication in Multi-Agent Systems with Hybrid Input/Output Automata

JOURNAL ARTICLE published 7 October 2012 in Electronic Proceedings in Theoretical Computer Science

Authors: Marta Capiluppi | Roberto Segala

Simplifying Nondeterministic Finite Cover Automata

JOURNAL ARTICLE published 21 May 2014 in Electronic Proceedings in Theoretical Computer Science

Authors: Cezar Câmpeanu